package org.example.binaryTree;

/**
 * 折纸问题
 *
 *
 */
public class PaperFolding {

    public static void printAllFolds(int N) {
        printProcess(1,N,true);
    }

    // down == true  凹折痕  down== false  凸折痕   i是节点层数，N一共多少层
    public static void  printProcess(int i,int N,boolean down) {
        if (i > N ) {
            return;
        }
        printProcess(i+1,N,true);
        System.out.println(down ? "凹" : "凸");
        printProcess(i+1,N,false);

    }

    public static void main(String[] args) {
        printAllFolds(3);
    }
}
